Deducing Queueing from Transactional Data: The Queue Inference Engine, Revisited

The Queue Inference Engine: Deducing Queue Statistics from Transactional Data

Packet Models Revisited: Tandem and Priority Systems

We examine two extensions of traditional single-node packet-scale queueing models: tandem networks and (strict) priority systems. Two generic input processes are considered: periodic and Poisson arrivals. For the two-node tandem, an exact expression is derived for the joint distribution of the total queue length, and the queue length of the first queue, implicitly determining the distribution o...

Optimizing the Number of Robots for Web Search Engines

Robots are deployed by a Web search engine for collecting information from diierent Web servers in order to maintain the currency of its data base of Web pages. In this paper, we investigate the number of robots to be used by a search engine so as to maximize the currency of the data base without putting an unnecessary load on the network. We use a queue-ing model to represent the system. The a...

New directions in queue inference for management implementation

Queue inference is a method of utilizing service-time data, available from ATM's, point-of-sale terminals, and other sources of transactional data, in order to estimate queue parameters. Three basic limitations to the standard method of queue inference are: the statistics generated by the algorithm may not be extensive enough; the running time for the algorithm is too long for large congestion ...

Multiple vacation policy for MX/Hk/1 queue with un-reliable server

This paper studies the operating characteristics of an MX/Hk/1 queueing system under multiple vacation policy. It is assumed that the server goes for vacation as soon as the system becomes empty. When he returns from a vacation and there is one or more customers waiting in the queue, he serves these customers until the system becomes empty again, otherwise goes for another vacation. The brea...